<link rel="stylesheet" href="socnetv.css" type="text/css" />


<h4><a name="License" id="License"></a>License</h4>
<p>
Copyright &copy 2005-2014 by Dimitris V. Kalamaras.  <br />
Blog: <a href="http://dimitris.apeiro.gr" target="_blank">http://dimitris.apeiro.gr</a>
</p>
<p>
This documentation is licensed under the terms of the GNU Free Documentation License.
</p>
<p>
This program is licensed under the terms of the GNU General Public License as   published by the Free Software Foundation
<a href="http://www.gnu.org/licenses/gpl.html"  target="_blank">http://www.gnu.org/licenses/gpl.html</a>. You have the right to use and copy it, study, modify and then redistribute the revised source code as long as you keep the source code free for the others. For a complete list of your rights and obligations by using this program please read the GPL.
</p>



<h4><a name="Credits" id="Credits"></a>Credits</h4>

<p>
Many thanks to:
</p>

<ul>
        <li>Filipe Clemente (bug reporting and useful comments)</li>
        <li>Caitlin Matos (Debian packaging for 1.x series)</li>
        <li>Serafeim Zanikolas (Debian packaging up to 0.90) </li>
        <li>Vaggelis Motesnitsalis (SRS Documentation)</li>
        <li>Tom Tryfonidis (Arch packaging)</li>
        <li>Markos Chandras (Gentoo packaging)</li>
        <li>Daniel Pinto dos Santos, for the now obsolete German translation</li>
	<li>Andre Somers, for bug fixing and useful comments</li>
	<li>Thomas Ingold, for betweenness bug reporting </li>
	<li>Steven Orr, for bug reporting</li>
	<li>Fred March, for bug reporting</li>
        <li>Alejandro Garrido Mota (Debian packaging)</li>
	<li>Martin Hohenberg</li>	
	<li>Victor Cardoso</li>
	<li>Paul Johnson</li>
	<li>David de Ugarte, for an older Spanish translation</li>
</ul>


<h4><a name="References" id="References"></a>References</h4>

	<ul>
        <li>Anthonisse, .I. M.(1971) The Rush in a Graph. Amsterdam: Mathematisch Centrum</li>
        <li>Brandes, U. (2001). A Faster Algorithm for Betweenness Centrality. <em>Journal of Mathematical Sociology</em>  25(2), pp.163-177.</li>
        <li>Brandes, U. (2001). Drawing on Physical Analogies.<em>In M. Kaufmann and D. Wagner (Eds.): Drawing Graphs: Methods and Models. </em> LNCS Tutorial 2025, pp. 71-86. </li>
        <li>Brin, S. and Page, L. (1998) <em>The Anatomy of a Large-Scale Hypertextual Web Search Engine</em>. In: Seventh International World-Wide Web Conference (WWW 1998), April 14-18, 1998, Brisbane, Australia.</li>
	<li>Dasgupta S., Papadimitriou C.H. & Vazirani U.V. (2006). <em>Algorithms.</em></li>
	<li>Davis, J. A. &amp; Leinhardt S. (1972). The Structure of Positive Relations in Small Groups.<em>In J. Berger (Ed.), Sociological Theories in Progress</em> , vol. 2. pp. 218-51. Boston, MA: Houghton Mifflin.</li>
	<li>Eades, P, (1984). A Heuristic for Graph Drawing. <em>Congressus Numerantuum</em>, 42:149-160.
	<li>Erdos, P. and Renyi, A. (1959). On Random Graphs. I. <em>Publicationes Mathematicae</em> 6: 290-297.</li>
	<li>Erdos, P. and Renyi, A. (1960). The Evolution of Random Graphs.<em> Magyar Tud. Akad. Mat. Kutat Int.</em> Kol. 5: 17-61.</li>
        <li>Freeman  L. C. (1979). Centrality in Social Networks Conceptual Clarification. Social Networks, 1 (1978/79), pp. 215-239</li>
        <li>Fruchterman, T.M.J. & Reingold, E.M. (1991). Graph Drawing by Force-Directed Placement. <em>Software-Practice & Experience.</em> Vol. 21, Is. 11, pp. 1129-1164.</li>
        <li>Gil, J. and Schmidt, S., (1996a). <em>The origin of the Mexican network of power</em>. In: International Social Network Conference, Charleston, SC, USA, pp. 22–25 </li>
        <li>Gil, J. and Schmidt, S., (1996b). <em>The political network in Mexico</em>. Social Networks 18, 355–381</li>
        <li>Holland, P.W. &amp; Leinhardt. S. (1970). A Method for Detecting Structure in Sociometric Data. <em>American Journal of Sociology</em>  70: 492-513.</li>
        <li>Holland, P.W. &amp; S. Leinhardt. (1971). Transitivity in Structural Models of Small Groups.<em> Comparative Group Studies</em>  2:107-124. </li>
        <li>Holland, P.W. &amp; S. Leinhardt. (1975). Local Structure in Social Networks. <em>Sociological Methodology<.em> 1976: 1-45</em>.</li>
        <li>Liu, C.L. (2000). <em>Elements of Discrete Mathematics</em> 2nd Edition. Greek Translation.</li>
        <li>Page L., Brin S., Motwani R., Winograd T. (1998). <em>The PageRank Citation Ranking: Bringing Order to the Web</em> </li>
        <li>Press W., Teukolsky S., Vetterling W. & Flannery B. (1992). <em>Numerical Recipes in C, the art of scientific computing.</em></li>
        <li>Sabidussi, G. (1966). <em>The centrality index of a graph</em>. Psychometrika 31, pp 581–603.</li>
        <li>Schank, T and Wagner. D (2005). Approximating Clustering Coefficient and Transitivity. <em>J. Graph Algorithms Appl.</em> 9(2): 265-275</li>
        <li>
        Stephenson K. and Zelen M. (1989). <em>Rethinking Centrality: Methods and examples</em>. Social Networks 11 1-37.</li>
	<li>Stroustrup B. (1997). <em>The C++ Programming Language.</em> </li>
	<li>Scott, J. (2000). <em>Social Network Analysis, A handbook.</em> </li>
        <li>Qt Project (2014). <em>Qt5: A cross-platform application and UI framework for developers using C++ or QML.</em> https://qt-project.org</li>
	<li>Wasserman S., Faust K. (2000). <em>Social Network Analysis. Methods and Applications.</em></li>
        <li>Watts, D.J., Strogatz, S.H. (1998). Collective dynamics of 'small-world' networks. <em> Nature</em> 393 (6684): 409–10. </li>


    </ul>


<h4><a name="Citation" id="Citation"></a>Citation</h4>
<p>
If you use SocNetv in your papers, please cite us as follows: <br />
<strong>Kalamaras D. <em>Social Network Visualizer (SocNetV)</em>.
Social network analysis and visualization software.
Home page: http://socnetv.sourceforge.net</strong>
</p>

<p>
For citing the SocNetv Manual, please use: <br />
<strong>Kalamaras D. (2014) The SocNetV Manual. <em>Social Network Visualizer (SocNetV)</em>.
http://socnetv.sourceforge.net</strong>
</p>
